Adaptation and parameters studies of CS algorithm for flow shop scheduling problem
نویسندگان
چکیده
Scheduling concerns the allocation of limited resources overtime to perform tasks fulfill certain criterion and optimize one or several objective functions. One most popular models in scheduling theory is that flow-shop scheduling. During last 40 years, permutation sequencing problem with makespan minimization has held attraction many researchers. This characterized as Fm/prmu/Cmax notation Graham, involves determination order processing n jobs on m machines. In addition, there was evidence m-machine (PFSP) strongly NP-hard for ≥3. Due this NP-hardness, heuristic approaches have been proposed, work falls within framework scientific research, whose purpose study Cuckoo search algorithm. Also, adapt cuckoo algorithm a generalized minimizing total completion time, so denoted follow: Fm | Cmax. Simulation results are judged by time run each instance processed.
منابع مشابه
A modified branch and bound algorithm for a vague flow-shop scheduling problem
Uncertainty plays a significant role in modeling and optimization of real world systems. Among uncertain approaches, fuzziness describes impreciseness while for ambiguity another definition is required. Vagueness is a probabilistic model of uncertainty being helpful to include ambiguity into modeling different processes especially in industrial systems. In this paper, a vague set based on dista...
متن کاملMILP Formulation and Genetic Algorithm for Non-permutation Flow Shop Scheduling Problem with Availability Constraints
In this paper, we consider a flow shop scheduling problem with availability constraints (FSSPAC) for the objective of minimizing the makespan. In such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. We proposed a mixed-integer linear programming (MILP) model for this problem which can generate non-permutation schedules. Furthermor...
متن کاملA multi-objective genetic algorithm (MOGA) for hybrid flow shop scheduling problem with assembly operation
Scheduling for a two-stage production system is one of the most common problems in production management. In this production system, a number of products are produced and each product is assembled from a set of parts. The parts are produced in the first stage that is a fabrication stage and then they are assembled in the second stage that usually is an assembly stage. In this article, the first...
متن کاملAn algorithm for multi-objective job shop scheduling problem
Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we pro...
متن کاملAlgorithm Performance and Problem Structure for Flow-shop Scheduling
Test suites for many domains often fail to model features present in real-world problems. For the permutation flow-shop sequencing problem (PFSP), the most popular test suite consists of problems whose features are generated from a single uniform random distribution. Synthetic generation of problems with characteristics present in real-world problems is a viable alternative. We compare the perf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Electrical and Computer Engineering
سال: 2021
ISSN: ['2088-8708']
DOI: https://doi.org/10.11591/ijece.v11i3.pp2266-2274